Series–parallel graphs are windy postman perfect

The Windy Postman Problem on Series-Parallel Graphs

The windy postman problem is the NP-hard problem of finding the minimum cost of a tour traversing all edges of an undirected graph, where the cost of traversal of an edge depends on the direction. Given an undirected graph G, we consider the polyhedron O(G) induced by the linear programming relaxation of a well-known integer programming formulation of the problem. We say that G is windy postman...

New results on the Windy Postman Problem

In this paper we study the Windy Postman Problem. This is a well known Arc Routing Problem which contains the Mixed Chinese Postman Problem as a special case. We present here a full description of the polyhedron associated to the Windy Postman Problem over graphs with up to 4 vertices and 10 edges. We introduce two new families of facet-inducing inequalities and we prove that these inequalities...

Plowing with precedence: A variant of the windy postman problem

New heuristic algorithms for the windy rural postman problem

In this paper we deal with the Windy Rural Postman Problem. This problem generalizes several important Arc Routing Problems and has interesting real-life applications. Here, we present several heuristics whose study has lead to the design of a Scatter Search algorithm for the Windy Rural Postman Problem. Extensive computational experiments over different sets of instances, with sizes up to 988 ...

Lower bounds and heuristics for the Windy Rural Postman Problem

In this paper we present several heuristic algorithms and a cutting-plane algorithm for the Windy Rural Postman Problem. This problem contains a big number of important Arc Routing Problems as special cases and has very interesting real-life applications. Extensive computational experiments over different sets of instances are also presented.